%% Months
@string{JAN = "January"}
@string{FEB = "February"}
@string{MAR = "March"}
@string{APR = "April"}
@string{MAY = "May"}
@string{JUN = "June"}
@string{JUL = "July"}
@string{AUG = "August"}
@string{SEP = "September"}
@string{OCT = "October"}
@string{NOV = "November"}
@string{DEC = "December"}

%%% Journals
@string{PIEEE = "Proceedings of the IEEE"}
@string{IEEEJSAC = "IEEE J. Selected Areas in Communications"}
@string{IEEETN = "IEEE/ACM Trans. Networking"}
@string{IEEETCOM = "IEEE Trans. Communications"}
@string{IEEETIT = "IEEE Trans. Information Theory"}
@string{INTERNETWORK = "Journal of Internetworking: Research and Experience"}
@string{IJDACS = "International Journal on Digital and Analog Communication Systems"}
@string{IJCS = "International Journal on Communication Systems"}
@string{ACMTCS = "ACM Trans. Computer Systems"}
@string{JACM = "J. of the ACM"}
@string{CC = "Computer Communications"}
@string{IPJ = "Internet Protocol Journal"}

%%% Magazines
@string{CACM = "Communications of the ACM"}
@string{COMPUTER = "IEEE Computer Magazine"}
@string{IEEECOM = "IEEE Communication Magazine"}
@string{IEEENET = "IEEE Network Magazine"}
@string{CCR = "ACM Computer Communication Review"}

%%% Conferences
@string{INFOCOM = "Proc. IEEE INFOCOM"}
@string{GLOBECOM = "Proc. IEEE GLOBECOM"}
@string{GINET = "Proc. IEEE Global Internet Symposium"}
@string{SIGCOMM = "Proc. ACM SIGCOMM"}
@string{CONEXT = "Proc. ACM CoNext"}
@string{IC3N = "Proc. IEEE IC3N"}
@string{SIGMETRICS = "Proc. ACM SIGMETRICS"}
@string{ICNP = "Proc. Inter. Conf. on Network Protocols"}
@string{ICC = "Proc. Inter. Conf. on Communications"}
@string{FTCS = "Proc. Fault-Tolerant Computing Symposium"}
@string{INET = "Proc. INET"}

%%% Publishers
@string{AW="Addison-Wesley"}
@string{CP="Cisco Press"}
@string{PH="Prentice Hall"}
@string{OR="O'Reilly"}

%%% Standards
@string{IETF = "IETF"}
@string{RFC = "RFC"}


@inproceedings{ basu,
 author = {Anindya Basu and Chih-Hao Luke Ong and April Rasala and F. Bruce Shepherd and Gordon Wilfong},
 title = {{Route oscillations in I-BGP with route reflection}},
 booktitle = SIGCOMM,
 year = {2002},
 pages = {235--247}
}

@inproceedings{griffinwilfong:2002a,
	author = "T. G. Griffin and G. Wilfong",
	title = "On the Correctness of {IBGP} Configuration",
	booktitle = SIGCOMM,
	month = SEP,
	year = 2002
}


@unpublished{rfc:1771,
    author = {Y. Rekhter and T. Li},
    title = {A {B}order {G}ateway {P}rotocol},
    note ={{RFC} 1771 (BGP version 4)},
    month = MAR,
    year = 1995
}

@unpublished{rfc:2796,
    author = {T. Bates and R. Chandra and E. Chen},
    title = {{BGP} Route Reflection - An Alternative to Full Mesh {IBGP}},
    note = {RFC 2796},
    year = 2000
}


@unpublished{rfc:3065,
    author = {P. Traina and D. McPherson and J. Scudder},
    title = {Autonomous System Confederations for {BGP}},
    note = {RFC 3065},
    year = 2001
}

@book{stewart:99,
	author = "John W. Stewart",
	title = "{BGP4: Inter-Domain Routing in the Internet}",
	publisher = AW,
	year = 1999
}

@ARTICLE{Kortsarz:99,
    author = {Guy Kortsarz},
    title = {On the Hardness of Approximating Spanners},
    journal = {Algorithmica},
    year = {1999},
    volume = {30},
    pages = {2001}
}

@inproceedings{vutukuru:06,
   author =       "Mythili Vutukuru and Paul Valiant and Swastik Kopparty and Hari Balakrishnan",
   title =        "{How to Construct a Correct and Scalable {iBGP} Configuration}",
   booktitle =    {IEEE INFOCOM},
   year =         {2006},
   month =        {April},
   address =      {Barcelona, Spain}
}

@inproceedings{buob:08,
  author = "Marc-Olivier Buob and Steve Uhlig and Mickael Meulle",
  title = "Designing Optimal {iBGP} Route-Reflection Topologies",
  booktitle = {IFIP Networking},
  year = {2008},
  month = {May},
  address = {Singapore}
}

@INPROCEEDINGS{xiao:03,
title={Optimizing {IBGP} route reflection network},
author={Li Xiao and Jun Wang and Nahrstedt, K.},
booktitle={Communications, 2003. ICC '03. IEEE International Conference on},
year={2003},
month={May},
volume={3},
number={},
pages={ 1765-1769 vol.3},
keywords={ Internet, graph theory, integer programming, routing protocols autonomous system, full mesh, integer programming model, internal border gateway protocol, operating efficiency, operating reliability, optimum reflection graph, route advertising, route reflection graph, route reflection network, route reflectors selection, topology optimization},
doi={10.1109/ICC.2003.1203903},
ISSN={}, }

@inproceedings{khot:02,
 author = {Khot, Subhash},
 title = {On the power of unique 2-prover 1-round games},
 booktitle = {STOC '02: Proceedings of the thiry-fourth annual ACM Symposium on Theory of Computing},
 year = {2002},
 isbn = {1-58113-495-9},
 pages = {767--775},
 location = {Montreal, Quebec, Canada},
 doi = {http://doi.acm.org/10.1145/509907.510017},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@inproceedings{levin:08,
 author = {H. Levin and M. Schapira and A. Zohar},
 title = {Internet Routing and Games},
 booktitle = {STOC '08: Proceedings of the 40th annual ACM Symposium on Theory of Computing},
 year = {2008},
 pages = {57--66},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{griffin:02,
 author = {Griffin, Timothy G. and Shepherd, F. Bruce and Wilfong, Gordon},
 title = {The stable paths problem and interdomain routing},
 journal = {IEEE/ACM Trans. Netw.},
 volume = {10},
 number = {2},
 year = {2002},
 issn = {1063-6692},
 pages = {232--243},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
 }

@inproceedings{fabrikant:08,
 author = {A. Fabrikant and C. Papadimitriou},
 title = {The complexity of game dynamics: {BGP} oscillations, sink equilibria, and beyond},
 booktitle = {SODA '08: Proceedings of the 19th annual ACM-SIAM symposium on Discrete algorithms},
 year = {2008},
 pages = {844--853},
 location = {San Francisco, California},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 }

@book{bollobas:01,
  author = {B. Bollobas},
  interHash = {d6845690efa62f6cf293b4acc97a569c},
  intraHash = {a08b7937f79ce0cf9854806274e42ee1},
  publisher = {Cambridge University Press},
  title = {Random Graphs},
  year = {2001},
  id = {827976},
  priority = {5}
}

@INCOLLECTION{CHK09,
  AUTHOR = {Moses Charikar and Hajiaghayi, Mohammad Taghi and Howard Karloff},
  TITLE = {Improved approximation algorithms for label cover problems},
  BOOKTITLE = {Proceedings of the 17th Annual European Symposium on Algorithms (ESA)},
  LOCATION = {Berlin},
  PUBLISHER = {Springer},
  YEAR = {2009},
  URL = {http://www-math.mit.edu/~hajiagha/LabelCover.pdf},
}

@article{Rocketfuel04,
 author = {Neil Spring and Ratul Mahajan and David Wetherall and Thomas Anderson},
 title = {Measuring ISP topologies with rocketfuel},
 journal = {IEEE/ACM Trans. Netw.},
 volume = {12},
 number = {1},
 year = {2004},
 issn = {1063-6692},
 pages = {2--16},
 doi = {http://dx.doi.org/10.1109/TNET.2003.822655},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
 }

@TechReport{POAMZ10,
  author = 	 {Jung Han Park and Ricardo Oliviera and Shane Amante and Danny McPherson and Lixia Zhang},
  title = 	 {Towards a systematic understanding of route reflection},
  institution =  {UCLA},
  year = 	 {2010},
  number = 	 {100006},
}

@inproceedings{DK11,
 author = {Dinitz, Michael and Krauthgamer, Robert},
 title = {Directed spanners via flow-based linear programs},
 booktitle = {Proceedings of the 43rd annual ACM Symposium on Theory of Computing},
 series = {STOC '11},
 year = {2011},
 isbn = {978-1-4503-0691-1},
 location = {San Jose, California, USA},
 pages = {323--332},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1993636.1993680},
 doi = {http://doi.acm.org/10.1145/1993636.1993680},
 acmid = {1993680},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {approximation algorithms, linear programming, spanners},
}

@inproceedings{BBMRY11,
 author = {Piotr Berman and Arnab Bhattacharyya and Konstantin Makarychev and Sofya Raskhodnikova and Grigory Yaroslavtsev},
 title = {Improved Approximation for the Directed Spanner Problem},
 booktitle = {Proceedings of the 38th International Colloquium on Automata, Languages and Programming},
 series = {ICALP '11},
 year = {2011},
}

@inproceedings{BGJRW09,
 author = {Bhattacharyya, Arnab and Grigorescu, Elena and Jung, Kyomin and Raskhodnikova, Sofya and Woodruff, David P.},
 title = {Transitive-closure spanners},
 booktitle = {Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms},
 year = {2009},
 pages = {932--941},
 }

@article{FKN12,
title = "Improved approximation algorithms for Directed Steiner Forest",
journal = "Journal of Computer and System Sciences",
volume = "78",
number = "1",
pages = "279 - 292",
year = "2012",
note = "<ce:title>JCSS Knowledge Representation and Reasoning</ce:title>",
issn = "0022-0000",
doi = "10.1016/j.jcss.2011.05.009",
url = "http://www.sciencedirect.com/science/article/pii/S0022000011000584",
author = "Moran Feldman and Guy Kortsarz and Zeev Nutov",
keywords = "Directed Steiner Forest",
keywords = "Approximation algorithm"
}
